Constructing normalisers in finite soluble groups

Constructing Normalisers in Finite Soluble Groups

This paper describes algorithms for constructing a Hall n-subgroup H of a finite soluble group G and the normaliser No(H). If G has composition length n, then H and No(H ) can be constructed using O(n ~ log IGI) and O(n ~ log IGI) group multiplications, respectively. These algorithms may be used to construct other important subgroups such as Carter subgroups, system normalisers and relative sys...

Normalisers in Limit Groups

Let Γ be a limit group, S ⊂ Γ a non-trivial subgroup, and N the normaliser of S. If H1(S,Q) has finite Q-dimension, then S is finitely generated and either N/S is finite or N is abelian. This result has applications to the study of subdirect products of limit groups. Limit groups (or ω-residually free groups) have received a good deal of attention in recent years, largely due to the work of Z. ...

Constructing Invariants for Finite Groups

Constructing Rational Representations of Finite Groups

intersections of prefrattini subgroups in finite soluble groups

‎let $h$ be a prefrattini subgroup of a soluble finite group $g$‎. ‎in the‎ ‎paper it is proved that there exist elements $x,y in g$ such that the equality‎ ‎$h cap h^x cap h^y = phi (g)$ holds‎.